Overlapping Linear Quadtrees and Spatio-Temporal Query Processing

نویسندگان

  • Theodoros Tzouramanis
  • Michael Vassilakopoulos
  • Yannis Manolopoulos
چکیده

s, London. [10] Worboys, M. F. (1994) A unified model for spatial andtemporal information. Comput. J., 37, 26–34. [11] Abraham, T. and Roddick, J. F. (1999) Survey of spatio-temporal databases. Geoinformatica, 3, 61–99. [12] Theodoridis, Y., Sellis, T., Papadopoulos, A. and Manolopoulos, Y. (1998) Specifications for efficient indexingin spatiotemporal databases. Proc. 7th Conf. on Statistical and Scientific Database Management Systems (SSDBM’98), Capri, Italy, pp. 123–132. IEEE Press. [13] Theodoridis, Y., Vazirgiannis, M. and Sellis, T. (1996) Spatiotemporal indexing for large multimedia applications. In Proc. 3rd IEEE Conf. on Multimedia Computing and Systems (ICMCS’96), pp. 441–448. [14] Nascimento, M. A., Silva, J. R. O. and Theodoridis, Y. (1999) Evaluation for access structures for discretely moving points. In Proc. Int. Workshop on Spatio-Temporal Database Management (STDBM’99), Edinburgh, UK, pp. 171–188.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Processing of Spatio-Temporal Queries in Image Databases

Overlapping Linear Quadtrees is a structure suitable for storing consecutive raster images according to transaction time (a database of evolving images). This structure saves considerable space without sacrificing time performance in accessing every single image. Moreover, it can be used for answering efficiently window queries for a number of consecutive images (spatio-temporal queries). In th...

متن کامل

Time split linear quadtree for indexing image databases

The Time Split B-Tree (TSBT) is modified for indexing a database of evolving binary images. This is accomplished by embedding ideas from Linear region Quadtrees that make the TSBT able to support spatio-temporal query processing. To improve query performance, additional pointers are added to the leaf-nodes of the TSBT. The resulting access method is called Time Split Linear Quadtree (TSLQ). Alg...

متن کامل

Benchmarking access methods for time-evolving regional data

In this paper we present a performance comparison of access methods for time-evolving regional data. Initially, we briefly review four temporal extensions of the Linear Region Quadtree: the Time-Split Linear Quadtree, the Multiversion Linear Quadtree, the Multiversion Access Structure for Evolving Raster Images and Overlapping Linear Quadtrees. These methods comprise a family of specialized acc...

متن کامل

6 Access Methods and Query Processing Techniques

The performance of a database management system (DBMS) is fundamentally dependent on the access methods and query processing techniques available to the system. Traditionally, relational DBMSs have relied on well-known access methods, such as the ubiquitous B-tree, hashing with chaining, and, in some cases, linear hashing [52]. Object-oriented and object-relational systems have also adopted the...

متن کامل

Indexing and Query Processing Techniques in Spatio-temporal Data

Indexing and query processing is an emerging research field in spatio temporal data. Most of the real-time applications such as location based services, fleet management, traffic prediction and radio frequency identification and sensor networks are based on spatiotemporal indexing and query processing. All the indexing and query processing applications is any one of the forms, such as spatio in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. J.

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2000